Reachability analysis for polynomial dynamical systems using the Bernstein expansion over polytopes
نویسندگان
چکیده
This paper is concerned with the reachability computation problem for polynomial dynamical systems. Such computations constitute a crucial component in algorithmic verification tools for hybrid systems and embedded software with polynomial dynamics, which have found applications in many engineering domains. We describe two methods for over-approximating reachable sets of such systems; these methods are based on a combination of the Bernstein expansion of polynomial functions and a representation of reachable sets by template polyhedra. Using a prototype implementation, the performance of the methods was demonstrated on a number of examples.
منابع مشابه
Reachability Analysis for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the reachability computation problem for polynomial dynamical systems. Such computations constitute a crucial component in algorithmic verification tools for hybrid systems and embedded software with polynomial dynamics, which have found applications in many engineering domains. We describe two methods for overapproximating reachable sets of such systems; these meth...
متن کاملReachability Analysis of Polynomial Systems Using Linear Programming Relaxations
In this paper we propose a new method for reachability analysis of the class of discrete-time polynomial dynamical systems. Our work is based on the approach combining the use of template polyhedra and optimization [25, 7]. These problems are non-convex and are therefore generally difficult to solve exactly. Using the Bernstein form of polynomials, we define a set of equivalent problems which c...
متن کاملExpansion methods for solving integral equations with multiple time lags using Bernstein polynomial of the second kind
In this paper, the Bernstein polynomials are used to approximate the solutions of linear integral equations with multiple time lags (IEMTL) through expansion methods (collocation method, partition method, Galerkin method). The method is discussed in detail and illustrated by solving some numerical examples. Comparison between the exact and approximated results obtained from these methods is car...
متن کاملBernstein measures on convex polytopes
We define the notion of Bernstein measures and Bernstein approximations over general convex polytopes. This generalizes well-known Bernstein polynomials which are used to prove the Weierstrass approximation theorem on one dimensional intervals. We discuss some properties of Bernstein measures and approximations, and prove an asymptotic expansion of the Bernstein approximations for smooth functi...
متن کاملAnalysis of Nonlinear Systems via Bernstein Expansions
This paper presents an analytical approach for the stability and bifurcation analyses of nonlinear dynamic systems that have polynomial and trigonometric nonlinearities. The method ensures that all equilibrium points in a bounded region of the state space are found and yields arbitrarily tight bounds to the parameter points where the system exhibits local bifurcations. The solution method requi...
متن کامل